Nuprl Lemma : m-at-feasible 11,40

i:Id, M:MsgA. Feasible(M Feasible((@i M)) 
latex


Definitionst  T, P & Q, Feasible(D), P  Q, x:AB(x), , ff, tt, if b then t else f fi , (@i M), M(i), P  Q, P  Q, t.2, t.1, M.din(l,tg), M.dout(l,tg), xt(x), Y, reduce(f;k;as), deq-member(eq;x;L), x  dom(f), Top, , mk-ma, f(x)?z, , x:AB(x), map(f;as), M sends on link l, b, Unit, , Valtype(da;k), MsgA, x(s), f(x), A c B, a:A fp B(a), False,
LemmasId wf, msga wf, ma-feasible wf, ma-empty-feasible, assert of bnot, eqff to assert, not wf, bnot wf, assert wf, iff transitivity, eqtt to assert, bool wf, id-deq wf, eqof wf, IdLnk wf, lsrc wf, ldst wf, deq property, rcv wf, Kind-deq wf, Knd wf, subtype-fpf-cap-top, fpf-sub-reflexive, top wf, ma-dout wf, ifthenelse wf, ma-din wf, ma-empty wf, decidable assert, decidable equal Id, decidable cand, ma-sends-on wf, finite-decidable-set, pi2 wf, map wf, false wf, idlnk-deq wf, deq-member wf, assert-deq-member, fpf-cap wf, ma-state wf, l member wf, pi1 wf

origin